Solving Parametric Polynomial Systems by RealComprehensiveTriangularize
نویسندگان
چکیده
In the authors’ previous work, the concept of comprehensive triangular decomposition of parametric semi-algebraic systems (RCTD for short) was introduced. For a given parametric semi-algebraic system, say S, an RCTD partitions the parametric space into disjoint semialgebraic sets, above each of which the real solutions of S are described by a finite family of triangular systems. Such a decomposition permits to easily count the number of distinct real solutions depending on different parameter values as well as to conveniently describe the real solutions as continuous functions of the parameters. In this paper, we present the implementation of RCTD in the RegularChains library, namely the RealComprehensiveTriangularize command. The use of RCTD is illustrated by the stability analysis of several biological systems.
منابع مشابه
Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملSolving Parametric Polynomial Equations and Inequalities by Symbolic Algorithms
The talk gives a survey on some symbolic algorithmic methods for solving systems of algebraic equations with special emphasis on parametric systems. Besides complex solutions I consider also real solutions of systems including inequalities. The techniques described include the Euclidean algorithm, Grr obner bases, characteristic sets, univariate and multivariate Sturm-Sylvester theorems, compre...
متن کاملA note on Solving Parametric Polynomial Systems
Lazard and Rouillier in [9], by introducing the concept of discriminant variety, have described a new and efficient algorithm for solving parametric polynomial systems. In this paper we modify this algorithm, and we show that with our improvements the output of our algorithm is always minimal and it does not need to compute the radical of ideals.
متن کاملAn algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations
This paper presents a new algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations. This algorithm is based on the computation of what we call parametric U -resultants. The parameters space, i.e., the set of values of the parameters is decomposed into a finite number of constructible sets. The solutions of the input polynomial system are given uniformly in e...
متن کاملOn Solving Parametric Polynomial Systems
Border polynomial and discriminant variety are two important notions related to parametric polynomial system solving, in particular, for partitioning the parameter values into regions where the solutions of the system depend continuously on the parameters. In this paper, we study the relations between those notions in the case of parametric triangular systems. We also investigate the properties...
متن کامل